The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule

Many network services, such as video conferencing and video on demand, have popularly used the multimedia communications. The attached hosts/routers are required to transmit data as multicasting in most multimedia applications. In order to provide an ecient data routing, routers must provide multicast capability. In this paper, a new cooling schedule in Hop®eld neural network with annealing strategy is proposed to calculate the shortest path (SP) tree for multicast open shortest path ®rst (MOSPF) protocol. The SP tree in multicast is built on demand and is rooted at the source node. To facilitate the hardware implementation, the annealed Hop®eld neural network could be a good candidate to deal with SP problems in packet switching computer networks. In addition, it is proved that the proposed new cooling schedule is more suitable in all range of ®xed temperature than the other demonstrated cooling schedules in the experimental results. Ó 2000 Elsevier Science Inc. All rights reserved.